Radical Non-Configurationality without Shuffle Operators: An Analysis of Wambaya

نویسندگان

  • Emily M. Bender
  • Stefan Müller
  • Scott Drellishak
  • Dan Flickinger
  • Tibor Kiss
  • Alex Lascarides
  • Stephan Oepen
  • Laurie Poulson
چکیده

The word order facts of radically non-configurational languages pose a challenge to HPSG approaches which assume both that the surface order of words is the yield of the (tectogrammatical) tree and standard HPSG-style cancellation of valence lists. These languages allow discontinuous noun phrases, in which modifiers appear separated from their head nouns by arbitrarily many other words from the same clause. In this paper, I explore an analysis which preserves tectogrammatical-phenogrammatical equivalence, and accounts for the word order facts of Wambaya with an analysis based on non-cancellation. This analysis is contrasted with other approaches to discontinuous constituents and analyses of other phenomena based on noncancellation. Finally, I explore the implications for current models of semantic compositionality.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluating a Crosslinguistic Grammar Resource: A Case Study of Wambaya

This paper evaluates the LinGO Grammar Matrix, a cross-linguistic resource for the development of precision broad coverage grammars, by applying it to the Australian language Wambaya. Despite large typological differences between Wambaya and the languages on which the development of the resource was based, the Grammar Matrix is found to provide a significant jump-start in the creation of the gr...

متن کامل

(Pure) transcendence bases in $\phi$-deformed shuffle bialgebras

Computations with integro-differential operators are often carried out in an associative algebra with unit and they are essentially non-commutative computations. By adjoining a cocommutative co-product, one can have those operators perform on a bialgebra isomorphic to an enveloping algebra. That gives an adequate framework for a computer-algebra implementation via monoidal factorization, (pure)...

متن کامل

Non-causal Fliess operators and their shuffle algebra

International Journal of Control Publication details, including instructions for authors and subscription information: http://www.informaworld.com/smpp/title~content=t713393989 Non-causal Fliess operators and their shuffle algebra W. S. Gray a; Y. Wang b a Department of Electrical and Computer Engineering, Old Dominion University, Norfolk, Virginia, USA b Department of Mathematical Sciences, Fl...

متن کامل

Online Scheduling for Shuffle Grouping in Distributed Stream Processing Systems Research Paper

Shuffle grouping is a technique used by stream processing frameworks to share input load among parallel instances of stateless operators. With shuffle grouping each tuple of a stream can be assigned to any available operator instance, independently from any previous assignment. A common approach to implement shuffle grouping is to adopt a RoundRobin policy, a simple solution that fares well as ...

متن کامل

A novel algorithm for the conversion of shuffle regular expressions into non-deterministic finite automata

Regular expressions with shuffle operators are widely used in diverse fields of computer science. The work presented here investigates the shuffling of regular expressions and their conversion into non-deterministic finite automata. The aim of the paper is to design a novel algorithm for constructing  -free non-deterministic finite automata from the shuffling of regular expressions. Non-determ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008